Convex hull results for the warehouse problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملOptimal Time-Space Tradeoff for the 2D Convex-Hull Problem
We revisit the read-only random-access model, in which the input array is read-only and a limited amount of workspace is allowed. Given a set of N two-dimensional points in a read-only input array and Θ(S) bits of extra workspace (where S ≥ lgN), we present an algorithm that runs in O(N/S + N lgS) time for constructing the convex hull formed by the given points. Following a lower bound for sort...
متن کاملParallelization alternatives and their performance for the convex hull problem
High performance machines have become available nowadays to an increasing number of researchers. Most of us might have both an access to a supercomputing center and an algorithm that could benefit from these high performance machines. The aim of the present work is to revisit all existing parallelization alternatives, including emerging technologies like software-only speculative parallelizatio...
متن کاملA convex Hull algorithm for solving a location problem
A problem in distance geometry is to find the location of an unknown point in a given convex set in Rk such that its farthest distance to n fixed points is minimum. In this paper we present an algorithm based on subgradient method and convex hull computation for solving this problem. A recent improvement of Quickhull algorithm for computing the convex hull of a finite set of planar points is ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2018
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2018.06.002